Linear sparse differential resultant formulas
نویسندگان
چکیده
منابع مشابه
Linear sparse differential resultant formulas
Let P be a system of n linear nonhomogeneous generic sparse ordinary differential polynomials in n − 1 differential indeterminates. In this paper, differential resultant formulas are presented to compute, whenever it exists, the sparse differential resultant ∂Res(P) introduced by Li, Gao and Yuan in [12], as the determinant of the coefficient matrix of an appropriate set of derivatives of diffe...
متن کاملA perturbed differential resultant based implicitization algorithm for linear DPPEs
Let K be an ordinary differential field with derivation ∂. Let P be a system of n linear differential polynomial parametric equations in n− 1 differential parameters with implicit ideal ID. Given a nonzero linear differential polynomial A in ID we give necessary and sufficient conditions on A for P to be n − 1 dimensional. We prove the existence of a linear perturbation Pφ of P so that the line...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کامل0 Explicit Formulas for the Multivariate Resultant
We present formulas for the multivariate resultant as a quotient of two determinants. They extend the classical Macaulay formulas, and involve matrices of considerably smaller size, whose non zero entries include coefficients of the given polynomials and coefficients of their Bezoutian. These formulas can also be viewed as an explicit computation of the morphisms and the determinant of a result...
متن کاملHybrid Sparse Resultant Matrices for Bivariate Polynomials
We study systems of three bivariate polynomials whose Newton polygons are scaled copies of a single polygon. Our main contribution is to construct square resultant matrices, which are submatrices of those introduced by Cattani et al. (1998), and whose determinants are nontrivial multiples of the sparse (or toric) resultant. The matrix is hybrid in that it contains a submatrix of Sylvester type ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.01.016